Genetic Algorithms for Evolving Computer Chess Programs
نویسندگان
چکیده
منابع مشابه
Evolving Chess Playing Programs
This contribution introduces a hybrid GP/ES system for the evolution of chess playing computer programs. We discuss the basic system and examine its performance in comparison to pre-existing algorithms of the type alphabeta and its improved variants. We can show that evolution is able to outperform these algorithms both in terms of eÆciency and strength.
متن کاملEvolving Portrait Painter Programs using Genetic Programming to Explore Computer
Creative systems as opposed to standard evolutionary systems favor exploration over optimization, finding innovative or novel solutions over a preconceived notion of a specific optimal solution. The best creative evolutionary systems only provide tools, allowing the evolutionary process to discover novelty and innovation on its own. We experiment with computer creativity by employing and modify...
متن کاملEvolving Computer Programs for Knowledge Discovery
Genetic Programming (GP) offers practical advantages to the researcher facing difficult optimization problems. These advantages are multifold, including the simplicity of the approach, its robust response to changing circumstance, its flexibility, and many other facets. GP can be applied to problems where heuristic solutions are not available or generally lead to unsatisfactory results. As a re...
متن کاملHierarchical Genetic Algorithms Operating on Populations of Computer Programs
Existing approaches to artificial intelligence problems such as sequence induction, automatic programming, machine learning, planning, and pattern recognition typically require specification in advance of the size and shape of the solution to the problem (often in a unnatural and difficult way). This paper reports on a new approach in which the size and shape of the solution to such problems is...
متن کاملEvolving Quasigroups by Genetic Algorithms
Quasigroups are a well-known combinatorial design equivalent to more familiar Latin squares. Because all possible elements of a quasigroup occur with equal probability, it makes it an interesting tool for the application in computer security and for production of pseudorandom sequences. Most implementations of quasigroups are based on look-up table of the quasigroup, on system of distinct repre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Evolutionary Computation
سال: 2014
ISSN: 1089-778X,1089-778X,1941-0026
DOI: 10.1109/tevc.2013.2285111